Positive semidefinite completions of partial Hermitian matrices
نویسندگان
چکیده
منابع مشابه
Permanents of Positive Semidefinite Hermitian Matrices
In this project, we are interested in approximating permanents of positive semidefinite Hermitian matrices. Specifically, we find conditions on positive semidefinite Hermitian matrices such that we can generalize the algorithm described in Sections 3.6 3.7 of [1] to matrices satisfying these conditions.
متن کاملInequalities Involving Khatri-rao Products of Positive Semidefinite Hermitian Matrices
In this paper, we obtain some matrix inequalities in Löwner partial ordering for Khatri-Rao products of positive semidefinite Hermitian matrices. Furthermore, we generalize the Oppenheim’s inequality, with which we will improve some recent results.
متن کاملSemidefinite Programming in the Space of Partial Positive Semidefinite Matrices
We build upon the work of Fukuda et al. [SIAM J. Optim., 11 (2001), pp. 647–674] and Nakata et al. [Math. Program., 95 (2003), pp. 303–327], in which the theory of partial positive semidefinite matrices was applied to the semidefinite programming (SDP) problem as a technique for exploiting sparsity in the data. In contrast to their work, which improved an existing algorithm based on a standard ...
متن کاملConvergence properties of preconditioned Hermitian and skew-Hermitian splitting methods for non-Hermitian positive semidefinite matrices
For the non-Hermitian and positive semidefinite systems of linear equations, we derive sufficient and necessary conditions for guaranteeing the unconditional convergence of the preconditioned Hermitian and skew-Hermitian splitting iteration methods. These result is specifically applied to linear systems of block tridiagonal form to obtain convergence conditions for the corresponding block varia...
متن کاملcompletions on partial matrices ?
An n × n matrix is called an N0-matrix if all its principal minors are nonpositive. In this paper, we are interested in N0-matrix completion problems, that is, when a partial N0-matrix has an N0-matrix completion. In general, a combinatorially or non-combinatorially symmetric partial N0-matrix does not have an N0-matrix completion. Here, we prove that a combinatorially symmetric partial N0-matr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1992
ISSN: 0024-3795
DOI: 10.1016/0024-3795(92)90304-s